A Class of Fejér Convergent Algorithms, Approximate Resolvents and the Hybrid Proximal-Extragradient Method
نویسنده
چکیده
A new framework for analyzing Fejér convergent algorithms is presented. Using this framework we define a very general class of Fejér convergent algorithms and establish its convergence properties. We also introduce a new definition of approximations of resolvents which preserve some useful features of the exact resolvent, and use this concept to present an unifying view of the Forward-Backward splitting method, Tseng’s Modified Forward-Backward splitting method and Korpelevich’s method. We show that methods based on families of approximate resolvents fall within the aforementioned class of Fejér convergent methods. We prove that such approximate resolvents are the iteration maps of the Hybrid Proximal-Extragradient method. 2010 Mathematics Subject Classification: 47H05, 49J52, 47N10.
منابع مشابه
A Hybrid Approximate Extragradient – Proximal Point Algorithm Using the Enlargement of a Maximal Monotone Operator
We propose a modification of the classical extragradient and proximal point algorithms for finding a zero of a maximal monotone operator in a Hilbert space. At each iteration of the method, an approximate extragradient-type step is performed using information obtained from an approximate solution of a proximal point subproblem. The algorithm is of a hybrid type, as it combines steps of the extr...
متن کاملHybrid proximal methods for equilibrium problems
This paper concerns developing two hybrid proximal point methods (PPMs) for finding a common solution of some optimization-related problems. First we construct an algorithm to solve simultaneously an equilibrium problem and a variational inequality problem, combing the extragradient method for variational inequalities with an approximate PPM for equilibrium problems. Next we develop another alg...
متن کاملA new modified approximate proximal-extragradient type method for monotone variational inequalities
In this paper, we propose a new approximate proximal point algorithm (APPA). The proposed method uses a new searching direction which differs from the other existing APPAs. Under some mild conditions, we show that the proposed method is globally convergent. The results presented in this paper extend and improve some well-known results in the literature.
متن کاملIteration-complexity of block-decomposition algorithms and the alternating minimization augmented Lagrangian method
In this paper, we consider the monotone inclusion problem consisting of the sum of a continuous monotone map and a point-to-set maximal monotone operator with a separable two-block structure and introduce a framework of block-decomposition prox-type algorithms for solving it which allows for each one of the single-block proximal subproblems to be solved in an approximate sense. Moreover, by sho...
متن کاملIteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
In this paper, we consider the monotone inclusion problem consisting of the sum of a continuous monotone map and a point-to-set maximal monotone operator with a separable two-block structure and introduce a framework of block-decomposition prox-type algorithms for solving it which allows for each one of the single-block proximal subproblems to be solved in an approximate sense. Moreover, by sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Optimization Theory and Applications
دوره 162 شماره
صفحات -
تاریخ انتشار 2014